Hitting probabilities and expected hitting times under a weak drift: on the 1/3-rule and beyond
نویسندگان
چکیده
When does a small drift increase the hitting probability of a boundary point / the expected hitting time of the boundary, compared to the driftless case? We analyze this for diffusion processes on [0,1] by expanding the Green function. In this way, in the appropriate diffusion approximation setting, we rederive and extend the one-third rule of evolutionary game theory (Nowak et al., 2004) and effects of stochastic slowdown (Altrock and Traulsen, 2009).
منابع مشابه
Drift Theory in Continuous Search Spaces: Expected Hitting Time of the (1+1)-ES with 1/5 Success Rule
This paper explores the use of the standard approach for proving runtime bounds in discrete domains—often referred to as drift analysis—in the context of optimization on a continuous domain. Using this framework we analyze the (1+1) Evolution Strategy with one-fifth success rule on the sphere function. To deal with potential functions that are not lower-bounded, we formulate novel drift theorem...
متن کاملHitting and commute times in large graphs are often misleading
Next to the shortest path distance, the second most popular distance function between vertices in a graph is the commute distance (resistance distance). For two vertices u and v, the hitting time Huv is the expected time it takes a random walk to travel from u to v. The commute time is its symmetrized version Cuv = Huv + Hvu. In our paper we study the behavior of hitting times and commute dista...
متن کاملSupplementary materials and proofs
2 Hitting times 3 2.1 Typical hitting times are large . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Exponential mixing on spatial graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Expected hitting times degenerate to the stationary distribution . . . . . . . . . . . . . . . . 6 2.4 The case of one dimension . . . . . . . . . . . . . . . ....
متن کاملFirst Hitting times of Simple Random Walks on Graphs with Congestion Points
We derive the explicit formulas of the probability generating functions of the first hitting times of simple random walks on graphs with congestion points using group representations. 1. Introduction. Random walk on a graph is a Markov chain whose state space is the vertex set of the graph and whose transition from a given vertex to an adjacent vertex along an edge is defined according to some ...
متن کاملEffective Aid for Hitting the Bull’s Eye; Comment on “It’s About the Idea Hitting the Bull’s Eye”: How Aid Effectiveness Can Catalyse the Scale-up of Health Innovations”
This article studies how six key aid effectiveness principles for “Hitting the bull’s eye” can bring about the scale up of maternal and newborn health (MNH) interventions. These key principles are based on accepted international agreements such as the Paris Declaration on Aid Effectiveness. The results indicate that the six principles should be a guide for recipient countries to take ownership ...
متن کامل